A Theory of Communicating Processes with Value Passing

A Semantic Theory for Value – Passing Processes

A Presheaf Semantics of Value-Passing Processes

This paper investigates presheaf models for process calculi with value passing. Denotational semantics in presheaf models are shown to correspond to operational semantics in that bisimulation obtained from open maps is proved to coincide with bisimulation as defined traditionally from the operational semantics. Both “early” and “late” semantics are considered, though the more interesting “late”...

Model Checking Value-Passing Processes

An algorithm for model checking value-passing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mu-calculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and contains the propositional mu-calculus as a proper subset. The algorithm instantiates input variab...

A Verification Tool for Value-Passing Processes

A proof system is described which is capable of handling processes with value-passing. It implements inference systems that treats data and boolean expressions symbolically. Users are allowed to deene the syntax and axioms for their own calculi. Proofs are performed by either invoking proof rules or applying equational axioms as rewrite rules. Help facilities are provided to make it easier to c...

Characterizing bisimilarity of value-passing parametrised processes

Symbolic transition graphs of Hennessy and Lin extended with assignments are considered. Semantics appealing to the notion of state is introduced for the symbolic transition graphs and their extended version. Showing strong early bisimulation between so represented value-passing processes is reduced to nding a solution of a set of equations involving state formulas.